Alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2. We also show strong edge chromatic number of two types of regular graphs with high degree and a note on a result of A. Alon提出的任何一个图的无圈边色数不超过其最大度加2的猜想。给出了两类高度正则图的强边色数,并对A。
The total chromatic of high degree graphs whose maximum degree vertices are non adjacent 最大度顶点互不相邻的高度图的全色数
Numerical calculation shows that a moderate chromatic aberration of lens gives rise to remarkable spectral changes in focused light field, and this spectral changes are dependent on the degree of spatial coherence of incident light and on the width of spectrum. 数值计算表明,适量的透镜色差就能使聚焦光场的光谱产生显著的变化,并且这种光谱变化还与入射光的空间相干度及光谱宽度有关。
Total Chromatic Number of Graphs of High Degree 高度图的全色数
The Strong Edge Chromatic Number of Regular Graphs with High Degree 高度正则图的强边色数